Bounds for the Smallest and the Largest Eigenvalues of Hermitian Matrices
نویسنده
چکیده
mons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract In this paper the author derives a lower bound for the largest eigen-value and an upper bound for the smallest eigenvalue of Hermitian matrices , based on Weyl's inequalities. Some related results, consequences, applications, and examples are provided. In the fifth section, the main result is applied to some integer matrices.
منابع مشابه
The bounds of the eigenvalues for rank-one modification of Hermitian matrix
The eigenproblems of the rank-one updates of the matrices have lots of applications in scientific computation and engineering such as the symmetric tridiagonal eigenproblems by the divide-andconquer method and Web search engine. Many researchers have well studied the algorithms for computing eigenvalues of Hermitian matrices updated by a rank-one matrix [1–6]. Recently, Ding and Zhou studied a ...
متن کاملOn the eigenvalues of some matrices based on vertex degree
The aim of this paper is to compute some bounds of forgotten index and then we present spectral properties of this index. In continuing, we define a new version of energy namely ISI energy corresponded to the ISI index and then we determine some bounds for it.
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملComputing Probabilistic Bounds for Extreme Eigenvalues of Symmetric Matrices with the Lanczos Method
We study the Lanczos method for computing extreme eigenvalues of a symmetric or Hermitian matrix. It is not guaranteed that the extreme Ritz values are close to the extreme eigenvalues—even when the norms of the corresponding residual vectors are small. Assuming that the starting vector has been chosen randomly, we compute probabilistic bounds for the extreme eigenvalues from data available dur...
متن کاملSpectral radii of sparse random matrices
We establish bounds on the spectral radii for a large class of sparse random matrices, which includes the adjacency matrices of inhomogeneous Erdős-Rényi graphs. For the Erdős-Rényi graph G(n, d/n), our results imply that the smallest and second-largest eigenvalues of the adjacency matrix converge to the edges of the support of the asymptotic eigenvalue distribution provided that d log n. Toget...
متن کامل